Tutorial on How to Measure Link Strengths in Discrete Bayesian Networks
نویسندگان
چکیده
This report discusses measures for link strength in Discrete Bayesian Networks, i.e. measures for the strength of connection along a specific edge. It is a revised version of Report GT-IIC-07-01 (Jan 2007) with improved literature review and explanations. The target application is the visualization of the strengths of the edge connections in a Bayesian Network learned from data to learn more about the inherent properties of the system. The report reviews existing link strength measures, provides an accessible derivation of the primary measure, proposes some simple variations of the primary measure and compares their resulting properties. 1 The Concept of Link Strength Boerlage was the first to formally introduce the concept of link strength for Bayesian Networks (Boerlage 1992). Boerlage defines connection strength for any pair of nodes (adjacent or not) to measure the strength between those nodes taking any possible path between them into account. In contrast link strength (also known as arc weight) is defined for a specific edge and measures the strength of connection only along that single edge. To demonstrate the difference between these concepts in particular for adjacent nodes consider the network in Figure 1. Each of the three nodes only has two states, True and False. Let us focus on the connection Joint appointment with the Robotics and Intelligent Machines Center, School of Interactive Computing, College of Computing, Atlanta, Georgia 30308. X
منابع مشابه
DisTriB: Distributed Trust Management Model Based on Gossip Learning and Bayesian Networks in Collaborative Computing Systems
The interactions among peers in Peer-to-Peer systems as a distributed collaborative system are based on asynchronous and unreliable communications. Trust is an essential and facilitating component in these interactions specially in such uncertain environments. Various attacks are possible due to large-scale nature and openness of these systems that affects the trust. Peers has not enough inform...
متن کاملDisTriB: Distributed Trust Management Model Based on Gossip Learning and Bayesian Networks in Collaborative Computing Systems
The interactions among peers in Peer-to-Peer systems as a distributed collaborative system are based on asynchronous and unreliable communications. Trust is an essential and facilitating component in these interactions specially in such uncertain environments. Various attacks are possible due to large-scale nature and openness of these systems that affects the trust. Peers has not enough inform...
متن کاملDevelopment and Usability Evaluation of an Online Tutorial for “How to Write a Proposal” for Medical Sciences Students
Background and Objective: Considering the importance of learning how to write a proposal for students, this study was performed to develop an online tutorial for “How to write a Proposal” for students and to evaluate its usability. Methods: This study is a developmental research and tool design. “Gamified Online Tutorial based on Self-Determination Theory (GOT-STD) Framework" became the basis f...
متن کاملThe Analysis of Bayesian Probit Regression of Binary and Polychotomous Response Data
The goal of this study is to introduce a statistical method regarding the analysis of specific latent data for regression analysis of the discrete data and to build a relation between a probit regression model (related to the discrete response) and normal linear regression model (related to the latent data of continuous response). This method provides precise inferences on binary and multinomia...
متن کاملA Multi Objective Graph Based Model for Analyzing Survivability of Vulnerable Networks
In the various fields of disaster management, choosing the best location for the Emergency Support & Supply Service Centers (ESSSCs) and the survivability of the network that provides the links between ESSSCs and their environment has a great role to be paid enough attention. This paper introduces a graph based model to measure the survivability of the linking's network. By values computed for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009